While some research has been performed on the human understanding of static graph layout algorithms, dynamic graph layout algorithms have only recently been developed sufficiently to enable similar investigations. This paper presents the first empirical analysis of a dynamic graph layout algorithm, focusing on the assumption that maintaining the "mental map" between time-slices assists with the comprehension of the evolving graph. The results confirm this assumption with respect to some categories of tasks
International audienceIn this paper, we present the results of a human computer interaction experime...
Visualizing graphs has been studied extensively in the community of graph drawing and information vi...
In this paper we introduce two novel algorithms for drawing sequences of orthogonal and hierarchical...
While some research has been performed on the human understanding of static graph layout algorithms,...
The design of automatic layout algorithms for single graphs is a well established field, and some re...
The design of automatic layout algorithms for single graphs is a well established field, and some re...
Abstract. While some research has been performed on the human un-derstanding of static graph layout ...
In dynamic graph drawing, preserving the mental map, or ensuring that the location of nodes do not c...
Research on effective algorithms for efficient graph layout continues apace, and faster technology h...
Preserving the mental map is frequently cited by dynamic graph drawing algorithm designers as an imp...
We present the results of a formal experiment that tests the ability of a participant to orient them...
We present the results of a formal experiment that tests the ability of a participant to orient them...
Users working with graph layouts form mental maps of the layout’s parts and relative structure. When...
Dynamic graph visualization is a key component of interactive graph visualization systems. Whenever ...
Several techniques for visualization of dynamic graphs are based on different spatial arrangements o...
International audienceIn this paper, we present the results of a human computer interaction experime...
Visualizing graphs has been studied extensively in the community of graph drawing and information vi...
In this paper we introduce two novel algorithms for drawing sequences of orthogonal and hierarchical...
While some research has been performed on the human understanding of static graph layout algorithms,...
The design of automatic layout algorithms for single graphs is a well established field, and some re...
The design of automatic layout algorithms for single graphs is a well established field, and some re...
Abstract. While some research has been performed on the human un-derstanding of static graph layout ...
In dynamic graph drawing, preserving the mental map, or ensuring that the location of nodes do not c...
Research on effective algorithms for efficient graph layout continues apace, and faster technology h...
Preserving the mental map is frequently cited by dynamic graph drawing algorithm designers as an imp...
We present the results of a formal experiment that tests the ability of a participant to orient them...
We present the results of a formal experiment that tests the ability of a participant to orient them...
Users working with graph layouts form mental maps of the layout’s parts and relative structure. When...
Dynamic graph visualization is a key component of interactive graph visualization systems. Whenever ...
Several techniques for visualization of dynamic graphs are based on different spatial arrangements o...
International audienceIn this paper, we present the results of a human computer interaction experime...
Visualizing graphs has been studied extensively in the community of graph drawing and information vi...
In this paper we introduce two novel algorithms for drawing sequences of orthogonal and hierarchical...